Typeset by Helmut Prodinger November NOTES ON OPEN ADDRESSING MY FIRST ANALYSIS OF AN ALGORITHM ORIGINALLY DONE DURING SUMMER IN MADISON
نویسنده
چکیده
Introduction and De nitions Open addressing is a widely used technique for keeping symbol tables The method was rst used in by Samuel Amdahl and Boehme in an assembly program for the IBM An extensive discussion of the method was given by Peterson in and frequent references have been made to it ever since e g Schay and Spruth Iverson However the timing characteristics have apparently never been exactly established and indeed the author has heard reports of several reputable mathematicians who failed to nd the solutions after some trial Therefore it is the purpose of this note to indicate one way by which the solution can be obtained We will use the following abstract model to describe the method N is a positive integer and we have an array of N variables x x xN At the beginning xi for i N To enter the k th item in the table we mean that an integer ak is calculated ak N depending only on the item and the following process is carried out Set j ak The comparison step If xj set xj and stop we say the k th item has fallen into position xj If j N go to step Increase j by and return to step The over ow step If this step is entered twice the table is full i e xi for i N Otherwise set j to and return to step
منابع مشابه
Notes on \ Open " Addressing [ My First Analysis of an Algorithm , Originallydone during Summer 1962 in Madison
متن کامل
Batcher's odd-even exchange revisited: A generating functions approach
The celebrated odd-even exchange algorithm by Batcher provides the quantity average number of exchanges, which was a mystery a few years ago and is still tricky today. We provide an approach that is purely based on generating functions to provide an explicit expression. The asymptotic analysis was done several years ago but never published in a journal and is thus provided here. It is a combina...
متن کاملGenetic Algorithms: Theory and Applications
FLLL 2 Preface This is a printed collection of the contents of the lecture " Genetic Algorithms: Theory and Applications " which I gave first in the winter semester 1999/2000 at the Johannes Kepler University in Linz. The reader should be aware that this manuscript is subject to further reconsideration and improvement. Corrections, complaints, and suggestions are cordially welcome. The sources ...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملApproximate counting with m counters: a probabilistic analysis
Motivated by a recent paper by Cichoń and Macyna [1], who introduced m counters (instead of just one) in the approximate counting scheme first analysed by Flajolet [2], we analyse the moments of the sum of the m counters, using techniques that proved to be successful already in several other contexts [11].
متن کامل